Heuristics for laying out information graphs
نویسندگان
چکیده
منابع مشابه
Laying Out Sparse Graphs with Provably Minimum Bandwidth
F a linear layout of a graph having minimum bandwidth is a combinatorial optimization problem that has been studied since the 1960s. Unlike other classical problems, the approach based on stating a suitable integer linear program and solving the associated linear-programming relaxation seems to be useless in this case. This makes it nontrivial to design algorithms capable of solving to optimali...
متن کاملIllustration for laying out the abstract
The problem of angular velocity stabilization for the spinning spacecraft is considered. The spacecraft is assumed to be supplied a passive inertial energy dissipater in the form of a spring-mass-dashpot and small resistojets. The satellite is subjected to a combination of an excitational time varying torque and a control torque. The energy-based speed-gradient (SG) control law is proposed and ...
متن کاملHeuristics and pedigrees for drawing directed graphs
We describe here a collection of heuristics for producing “nice”drawings of directed graphs, and a simple dual-mode software tool for testing and evaluating them. In playing mode, the heuristics are applied in random sequence over a set of drawings, in the manner of an asynchronous team (A-team). As new drawings are added to the set, others are deleted based on a multi-valued aesthetic evaluati...
متن کاملGeometry based heuristics for unit disk graphs
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. We also present an on-line coloring heuristic which achieves a compe...
متن کاملSimple heuristics for unit disk graphs
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. We also present an on-line coloring heuristic which achieves a compe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing
سال: 1994
ISSN: 0010-485X,1436-5057
DOI: 10.1007/bf02276884